A local limit theorem with speed of convergence for Euclidean algorithms and diophantine costs

For large N , we consider the ordinary continued fraction of x = p/q with 1 ≤ p ≤ q ≤ N , or, equivalently, Euclid’s gcd algorithm for two integers 1 ≤ p ≤ q ≤ N , putting the uniform distribution on the set of p and qs. We study the distribution of the total cost of execution of the algorithm for an additive cost function c on the set Z∗+ of possible digits, asymptotically for N → ∞. If c is nonlattice and satisfies mild growth conditions, the local limit theorem was proved previously by the second named author. Introducing diophantine conditions on the cost, we are able to control the speed of convergence in the local limit theorem. We use previous estimates of the first author and Vallée, and we adapt to our setting bounds of Dolgopyat and Melbourne on transfer operators. Our diophantine condition is generic. For smooth enough observables (depending on the diophantine condition) we attain the optimal speed.